home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
tsql
/
doc
/
tsql.mail
/
000016_csj@iesd.auc.dk _Thu Nov 19 18:22:22 1992.msg
< prev
next >
Wrap
Internet Message Format
|
1996-01-31
|
3KB
Received: from iesd.auc.dk by optima.cs.arizona.edu (5.65c/15) via SMTP
id AA01672; Thu, 19 Nov 1992 10:22:40 MST
Received: from yellow.iesd.auc.dk by iesd.auc.dk with SMTP id AA02032
(5.65c8/IDA-1.4.4.5 for <tsql@cs.arizona.edu>); Thu, 19 Nov 1992 18:22:22 +0100
Date: Thu, 19 Nov 1992 18:22:22 +0100
From: "Christian S. Jensen" <csj@iesd.auc.dk>
Message-Id: <199211191722.AA02032@iesd.auc.dk>
To: tsql@cs.arizona.edu
Subject: Value equivalence glossary entry
The following is a proposal for an entry for the temporal database
glossary.
Best regards,
Christian S. Jensen
\documentstyle[11pt]{article}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% VARIOUS MACROS
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\long\def\comment#1{}
\newcommand{\entry}[1]{\subsubsection*{#1}}
\addtolength{\textwidth}{1.485in}%{1.2in}
\setlength{\oddsidemargin}{.1in}%{.3in}
\setlength{\evensidemargin}{.1in}%{.3in}
\addtolength{\topmargin}{-.85in} %{-1.35in}
\addtolength{\textheight}{1.8in} %{2.8in}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% PAPER START
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{document}
\subsection{Value Equivalence}
\entry{Definition}
Informally, two tuples on the same (temporal) relation schema are {\em
value equivalent} if they have identical non-timestamp attribute
values.
To formally define the concept, let temporal relation schema $R$ have
$n$ time dimensions, $D_i$, $i = 1, \ldots, n$, and let $\tau^i$, $i =
1, \ldots, n$ be corresponding timeslice operators, e.g., the valid
timeslice and transaction timeslice operators. Then tuples $x$ and $y$
are value equivalent if
\begin{eqnarray*}
\exists t_1 \in D_1 \ldots \exists t_n \in D_n (\tau^n_{t_n}(
\ldots (\tau^1_{t_1}(x)) \ldots ) \neq \emptyset)
& \wedge &
\exists s_1 \in D_1, \ldots, s_n \in D_n (\tau^n_{s_n}( \ldots
(\tau^1_{s_1}(y)) \ldots ) \neq \emptyset) \\
\Rightarrow \;\;\;
\bigcup_{\forall t_1 \in D_1,\ldots, t_n \in D_n}
\hspace*{-.8cm}\tau^n_{t_n}(\ldots(\tau^1_{t_1}(x))\ldots)
\hspace{.6cm} & = &
\bigcup_{\forall s_1 \in D_1,\ldots, s_n \in D_n}
\hspace*{-.8cm}\tau^n_{s_n}(\ldots(\tau^1_{s_1}(y))\ldots)
\end{eqnarray*}
\noindent
Thus the set of tuples in snapshots of $x$ and the set of tuples in
snapshots of $y$ are required to be identical. This is required only
when each tuple has some non-empty snapshot.
\entry{Alternative Names}
None.
\entry{Discussion}
The concept of value equivalent tuples has been shaped to be
convenient when addressing concepts such as coalescing, normal forms,
etc. The concept is distinct from related notions of the normal form
SG1NF and {\em mergeable} tuples.
Phrases such as ``having the same visible attribute values'' and
``having duplicate values'' have been used previously.
The orthogonality criterion (+E1) is satisfied. Further, the concept
is a straight-forward generalization of identity of tuples in the
snapshot-relational model. There are no competing names (+E3), the
name seems open-endend (+E4) and does not appear to have other
meanings (+E5). Further, the name is consistent with existing
terminology (+E7) and does not violate other criteria.
\end{document}